A note on quadratic residuosity and UP
نویسندگان
چکیده
UP is the class of languages accepted by polynomial-time nondeterministic Turing machines that have at most one accepting path. We show that the quadratic residue problem belongs to UP ∩ coUP. This affirmatively answers an open problem, discussed in Theory of Computational Complexity (Du and Ko, 2000), of whether the quadratic nonresidue problem is in NP. We generalize to higher powers and show the higher power residue problem belongs to UP ∩ coUP.
منابع مشابه
On Identity-Based Cryptosystems from Quadratic Residuosity
Three approaches are currently used for devising identity-based encryption schemes. They build on pairings, quadratic residues (QR), and lattices, respectively. Among them, the QR-based scheme proposed by Cocks in 2001 is notable in that it works in standard RSA groups: its security relies on the standard quadratic residuosity assumption. But is has also a number of deficiencies, some of them h...
متن کاملBounded-Collusion IBE from Key Homomorphism
In this work, we show how to construct IBE schemes that are secure against a bounded number of collusions, starting with underlying PKE schemes which possess linear homomorphisms over their keys. In particular, this enables us to exhibit a new (bounded-collusion) IBE construction based on the quadratic residuosity assumption, without any need to assume the existence of random oracles. The new I...
متن کاملUniversally Anonymous IBE Based on the Quadratic Residuosity Assumption
We introduce the first universally anonymous, thus key-private, IBE whose security is based on the standard quadratic residuosity assumption. Our scheme is a variant of Cocks IBE (which is not anonymous) and is efficient and highly parallelizable.
متن کاملIdentity-Based Cryptosystems and Quadratic Residuosity
Three approaches are currently used for devising identitybased encryption schemes. They respectively build on pairings, quadratic residues (QR), and lattices. Among them, the QR-based scheme proposed by Cocks in 2001 is notable in that it works in standard RSA groups: its security relies on the standard quadratic residuosity assumption. But it has also a number of deficiencies, some of them hav...
متن کاملReplication Is Not Needed
We establish the following, quite unexpected, result: replication of data for the computational Private Information Retrieval problem is not necessary. More speci cally, based on the quadratic residuosity assumption, we present a single database, computationally-private information-retrieval scheme with O(n ) communication complexity for any > 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 92 شماره
صفحات -
تاریخ انتشار 2004